TSkim : A tool for skimming ROOT trees

Verified Root-Balanced Trees

Andersson introduced general balanced trees, search trees based on the design principle of partial rebuilding: perform update operations naively until the tree becomes too unbalanced, at which point a whole subtree is rebalanced. We define and analyze a functional version of general balanced trees which we call root-balanced trees. Using a lightweight model of execution time, amortized logarith...

Stochastic Steiner Trees Without a Root

This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries to capture the fact that many infrastructure planning problems have to be solved in the presence of uncertainty, and that we have make decisions knowing merely market forecasts (and not the precise set of demands); by the time t...

Personalized Environment for Skimming Documents

We developed a support system for skimming documents on computer screen. The system has interface for document readability from computer screen and recommends personalized summaries. The interface of this system is introduced the visualized effect based on combining fisheye view and overview+detail; the focus points of fisheye view are selected sentences by using the original extraction algorit...

PhySortR: a fast, flexible tool for sorting phylogenetic trees

Rapidly-Exploring Random Trees: A New Tool for Path Planning